A sprouting tree model for random boolean functions
نویسندگان
چکیده
منابع مشابه
A sprouting tree model for random boolean functions
We define a new probability distribution for Boolean functions of k variables. Consider the random Binary Search Tree of size n, and label its internal nodes by connectives and its leaves by variables or their negations. This random process defines a random Boolean expression which represents a random Boolean function. Finally, let n tend to infinity: the asymptotic distribution on Boolean func...
متن کاملBoolean Functions for Finite-Tree Dependencies
Several logi -based languages, su h as Prolog II and its su essors, SICStus Prolog and Oz, o er a omputation domain in luding rational trees. In nite rational trees allow for inreased expressivity ( y li terms an provide eÆ ient representations of grammars and other useful obje ts) and for faster uni ation (due to the safe omission of the o urshe k). Unfortunately, the use of in nite rational t...
متن کاملRandom Tessellations and Boolean Random Functions
Generalizations of various random tessellation models generated by Poisson point processes are proposed and their functional probability P (K) is given. They are interpreted as characteristics of Boolean random functions models, which provide a generic way of simulation of general random tessellations.
متن کاملBinary decision diagrams for random Boolean functions
Binary Decision Diagrams (BDDs) are a data structure for Boolean functions which are also known as branching programs. In ordered binary decision diagrams (OBDDs), the tests have to obey a fixed variable ordering. In free binary decision diagrams (FBDDs), each variable can be tested at most once. The efficiency of new variants of the BDD concept is usually demonstrated with spectacular (worst-c...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2014
ISSN: 1042-9832
DOI: 10.1002/rsa.20567